Adaptive partitioning strategies for ternary tree structures
نویسنده
چکیده
Uhlmann, J.K., Adaptive partitioning strategies for ternary tree structures, Pattern Recognition Letters 12 (1991) 537-541. Test results of three adaptive partition strategies for constructing multidimensional ternary trees are presented. Such trees can be used to efficiently identify correlated measurements with error bounds that can be represented as finite volumes.
منابع مشابه
Weakly prime ternary subsemimodules of ternary semimodules
In this paper we introduce the concept of weakly prime ternary subsemimodules of a ternary semimodule over a ternary semiring and obtain some characterizations of weakly prime ternary subsemimodules. We prove that if $N$ is a weakly prime subtractive ternary subsemimodule of a ternary $R$-semimodule $M$, then either $N$ is a prime ternary subsemimodule or $(N : M)(N : M)N = 0$. If $N$ is a $Q$-...
متن کاملTernary Tree Optimalization for n-gram Indexing
N-gram indexing is used in many practical applications. Spam detection, plagiarism detection or comparison of DNA reads. There are many data structures that can be used for this purpose, each with different characteristics. In this article the ternary search tree data structure is used. One improvement of ternary tree that can save up to 43% of required memory is introduced. In the second part ...
متن کاملEfficient In-memory Data Structures for n-grams Indexing
Indexing n-gram phrases from text has many practical applications. Plagiarism detection, comparison of DNA of sequence or spam detection. In this paper we describe several data structures like hash table or B+ tree that could store n-grams for searching. We perform tests that shows their advantages and disadvantages. One of neglected data structure for this purpose, ternary search tree, is deep...
متن کاملTernary Tree and Memory-Efficient Huffman Decoding Algorithm
In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the encoded symbols and proposed a memory efficient data structure to represent the codeword length of ...
متن کاملA Modified Ternary Tree for Adaptive Huffman Encoding Data Structure
The relevance and importance of data compression has shown a growing trend from the past four decades and is expected to continue remaining the same in the coming time. This paper has provided an overview of popular adaptive data compression methods of general utility. It evaluated these existing algorithms with a newly proposed scheme – Ternary Tree algorithm, implemented with improvements to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition Letters
دوره 12 شماره
صفحات -
تاریخ انتشار 1991